Binomial Coefficients and Littlewood–Richardson Coefficients for Jack Polynomials
نویسنده
چکیده
In this paper, we consider translation and multiplication operators acting on the rings of symmetric and nonsymmetric polynomials and study their matrix coefficients with respect to the bases of Jack polynomials and interpolation polynomials. The main new insight is that the symmetric and nonsymmetric cases share a key combinatorial feature, that of a locally finite graded poset with a minimum element. This allows us to treat both cases in a simple and unified manner.
منابع مشابه
Littlewood-Richardson coefficients and Kazhdan-Lusztig polynomials
We show that the Littlewood-Richardson coefficients are values at 1 of certain parabolic Kazhdan-Lusztig polynomials for affine symmetric groups. These q-analogues of Littlewood-Richardson multiplicities coincide with those previously introduced in [21] in terms of ribbon tableaux.
متن کاملA polynomiality property for Littlewood-Richardson coefficients
We present a polynomiality property of the Littlewood-Richardson coefficients c λμ . The coefficients are shown to be given by polynomials in λ, μ and ν on the cones of the chamber complex of a vector partition function. We give bounds on the degree of the polynomials depending on the maximum allowed number of parts of the partitions λ, μ and ν. We first express the Littlewood-Richardson coeffi...
متن کاملJack polynomials, generalized binomial coefficients and polynomial solutions of the generalized Laplace’s equation
We discuss the symmetric homogeneous polynomial solutions of the generalized Laplace’s equation which arises in the context of the Calogero-Sutherland model on a line. The solutions are expressed as linear combinations of Jack polynomials and the constraints on the coefficients of expansion are derived. These constraints involve generalized binomial coefficients defined through Jack polynomials...
متن کاملExplicit computation of the q,t-Littlewood–Richardson coefficients
In joint work with Michel Lassalle [C. R. Math. Acad. Sci. Paris 337 (9) (2003), 569–574], we recently presented an explicit expansion formula for Macdonald polynomials. This result was obtained from a recursion for Macdonald polynomials which in turn was derived by inverting the Pieri formula. We use these formulae here to explicitly compute the q, t-Littlewood– Richardson coefficients, thus s...
متن کاملLittlewood–Richardson polynomials
We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are polynomials in the parameters which we call the Littlewood–Richardson polynomials. We give a combinatorial rule for their calculation by modifying an earlier resu...
متن کامل